Approximate Parameterized Matching CARMIT HAZAY AND MOSHE LEWENSTEIN Bar-Ilan University AND DINA SOKOL

Source URL: www.eng.biu.ac.il

• String matching algorithms
• Analysis of algorithms
• Donald Knuth
• Knuth–Morris–Pratt algorithm
• String searching algorithm
• Matching
• Time complexity
• Suffix tree
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

SIGCHI Conference Paper Format

Source URL: www.asis.org

• Complexity
• Holism
• Systems
• Transdisciplinarity
• Ethology
• Mind
• Model of hierarchical complexity
• Computational complexity theory
• Complex systems theory
• Science
• Abstraction

WORKSHOP MISSION Quantum mechanics promises extraordinary capabilities for computation and cryptography. However, as classical beings, we cannot directly verify quantum states or quantum operations. How can we trust the

Source URL: web.eecs.umich.edu

• Quantum cryptography
• Computational complexity theory
• Information theory
• Quantum computer
• Quantum information
• Theoretical computer science
• Applied mathematics
• Quantum mechanics

A Mergeable Summaries Pankaj K. Agarwal, Graham Cormode, Zengfeng Huang, Jeff M. Phillips, Zhewei Wei, and Ke Yi We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two

Source URL: www.cs.utah.edu

• Mathematics
• Algorithms
• Streaming algorithm
• Time complexity
• Quantile
• Applied mathematics
• Computational complexity theory
• Computer science

Path Logics for Querying Graphs: Combining Expressiveness and Efficiency Diego Figueira Leonid Libkin

Source URL: homepages.inf.ed.ac.uk

• Mathematics
• Applied mathematics
• FO
• Computational complexity theory
• Regular language
• Valuation
• Automata theory
• Formal languages
• Theoretical computer science

Efficient Set Operations in the Presence of Malicious Adversaries Carmit Hazay∗ Kobbi Nissim† November 25, 2010

Source URL: www.eng.biu.ac.il

• Computational complexity theory
• Secure multi-party computation
• Commitment scheme
• Homomorphic encryption
• Secure two-party computation
• Paillier cryptosystem
• Oblivious transfer
• Zero-knowledge proof
• Communication complexity
• Cryptography
• Cryptographic protocols
• Public-key cryptography

BRICS Basic Research in Computer Science BRICS RSL. Kristiansen: The Implicit Computational Complexity of Imperative Programming Languages The Implicit Computational Complexity of

Source URL: www.brics.dk

On the Computational Complexity of Sensor Network Localization James Aspnes? , David Goldenberg?? , and Yang Richard Yang? ? ? Yale University Department of Computer Science New Haven, CT, USA

Source URL: www-net.cs.yale.edu

Bounding the Computational Complexity of Flowchart Programs with Multi-dimensional Rankings Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord To cite this version: Christophe Alias, Alain Darte, Paul Feautrier

Source URL: hal.inria.fr

Logic and Computational Complexity 2012 INVITED SPEAKER: Etienne Grandjean TITLE: An invitation to linear time complexity ABSTRACT: The polynomial time class (PTIME) is one of the most fundamental complexity classes, gen

Source URL: ptmat.fc.ul.pt